Experiments on String Matching in Memory Structures

Various string matching algorithms have been designed and some experimental works on string matching over bounded alphabets have been performed but string matching over unbounded alphabets has been little investigated. We present here experimental results where symbols are taken among potentially innnite sets such as integers, reals or composed structures. These results show that in most cases it is better to decompose each symbols into a sequence of bytes and use algorithms which assume that the alphabet is bounded and use heuristics on symbols.